ETRU: NTRU over the Eisenstein integers
نویسندگان
چکیده
NTRU is a public-key cryptosystem based on polynomial rings over Z. Replacing Z with the ring of Eisenstein integers yields ETRU. We prove through both theory and implementation that ETRU is faster and has smaller keys for the same or better level of security than does NTRU.
منابع مشابه
ILTRU: An NTRU-Like Public Key Cryptosystem Over Ideal Lattices
In this paper we present a new NTRU-Like public key cryptosystem with security provably based on the worst case hardness of the approximate both Shortest Vector Problem (SVP) and Closest Vector Problem (CVP) in some structured lattices, called ideal lattices. We show how to modify the ETRU cryptosystem, an NTRU-Like public key cryptosystem based on the Eisenstein integers 3 [ ] where 3 is a...
متن کاملEEH: AGGH-like public key cryptosystem over the eisenstein integers using polynomial representations
GGH class of public-key cryptosystems relies on computational problems based on the closest vector problem (CVP) in lattices for their security. The subject of lattice based cryptography is very active and there have recently been new ideas that revolutionized the field. We present EEH, a GGH-Like public key cryptosystem based on the Eisenstein integers Z [ζ3] where ζ3 is a primitive...
متن کاملNTRU over rings beyond \mathbbZ{\mathbb{Z}}
The NTRU cryptosystem is constructed on the base ring Z. We give suitability conditions on rings to serve as alternate base rings. We present an example of an NTRU-like cryptosystem based on the Eisenstein integers Z[ζ3], which has a denser lattice structure than Z for the same dimension, and which furthermore presents a more difficult lattice problem for lattice attacks, for the same level of ...
متن کاملLehmer's Conjecture for Hermitian Matrices over the Eisenstein and Gaussian Integers
We solve Lehmer’s problem for a class of polynomials arising from Hermitian matrices over the Eisenstein and Gaussian integers, that is, we show that all such polynomials have Mahler measure at least Lehmer’s number τ0 = 1.17628 . . . .
متن کاملNTRU: A Ring-Based Public Key Cryptosystem
We describe NTRU, a new public key cryptosystem. NTRU features reasonably short, easily created keys, high speed, and low memory requirements. NTRU encryption and decryption use a mixing system suggested by polynomial algebra combined with a clustering principle based on elementary probability theory. The security of the NTRU cryptosystem comes from the interaction of the polynomial mixing syst...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید
ثبت ناماگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید
ورودعنوان ژورنال:
- Des. Codes Cryptography
دوره 74 شماره
صفحات -
تاریخ انتشار 2015